Expanders made elementary: A combinatorial analysis of an expander construction
نویسندگان
چکیده
We give a fully combinatorial analysis (using edge expansion) of an iterative expander construction due to Reingold, Vadhan, and Wigderson [RVW02]. This shows that both the construction of constantdegree expanders and its analysis can be carried out using only elementary combinatorial tools.
منابع مشابه
Systolic Expanders of Every Dimension
In recent years a high dimensional theory of expanders has emerged. The notion of combinatorial expanders of graphs (i.e. the Cheeger constant of a graph) has seen two generalizations to high dimensional simplicial complexes. One generalization, known as coboundary expansion is due to Linial and Meshulem; the other, which we term here systolic expansion, is due to Gromov, who showed that systol...
متن کاملAn Explicit Construction of Quantum Expanders
Quantum expanders are a natural generalization of classical expanders. These objects were introduced and studied by [1, 3, 4]. In this note we show how to construct explicit, constant-degree quantum expanders. The construction is essentially the classical Zig-Zag expander construction of [5], applied to quantum expanders.
متن کاملExpansion in Lifts of Graphs
The central goal of this thesis is to better understand, and explicitly construct, expanding towers G1,G2, . . ., which are expander families with the additional constraint that Gn+1 is a lift of Gn . A lift G of H is a graph that locally looks like H , but may be globally di erent; lifts have been proposed as a more structured setting for elementary explicit constructions of expanders, and the...
متن کاملQuantum margulis expanders
Received (received date) Revised (revised date) We present a simple way to quantize the well-known Margulis expander map. The result is a quantum expander which acts on discrete Wigner functions in the same way the classical Margulis expander acts on probability distributions. The quantum version shares all essential properties of the classical counterpart, e.g., it has the same degree and spec...
متن کاملLecture 7 : Expanders
In this lecture we give basic background about expander graphs. Expanders are graphs with strong connectivity properties: every two large subsets of vertices in an expander have many edges connecting them. Surprisingly, one can construct very sparse graphs that are expanders, and this is what makes them so useful. Expanders have a huge number of applications in theoretical computer science: in ...
متن کامل